Improved Force-Directed Layouts
نویسندگان
چکیده
Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected graphs. Aspects of symmetry, structure, clustering and reasonable vertex distribution arise from initial, formless clouds of points. However, when nodes must be labeled and point vertices are replaced by non-point vertices, simple force-directed models produce unreadable drawings, even for a moderate number of nodes. This paper describes the application of two post-processing techniques that can be applied to any initial vertex layout to produce uncluttered layouts with non-point nodes.
منابع مشابه
User Control of Force-directed Layouts
Force-directed layouts are typically used for minimizing overlaps in node-link graphs. This can make it easier to interpret and derive meaning from the resulting visualization. Once such a layout is put in motion, however, the person interacting with it has little control over the “final” layout. This paper describes an approach that puts even inexperienced users in charge of force-directed lay...
متن کاملIncreasing the readability of graph drawings with centrality-based scaling
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networks can result in drawings that are not highly readable in the dense areas. Additionally, networks whose layouts are defined geographically often have dense areas that are located within small geographical regions relat...
متن کاملSync-and-Burst: Force-Directed Graph Drawing with Uniform Force Magnitudes
We introduce a force-directed algorithm, called Sync-andBurst, which falls into the category of classical force-directed graph drawing algorithms. A distinct feature in Sync-and-Burst is the use of simplified forces of attraction and repulsion whose magnitude does not depend on the distance between vertices. Instead, magnitudes are uniform throughout the graph at each iteration and monotonicall...
متن کاملSpring Embedders and Force Directed Graph Drawing Algorithms
Force-directed algorithms are among the most flexible methods for calculating layouts of simple undirected graphs. Also known as spring embedders, such algorithms calculate the layout of a graph using only information contained within the structure of the graph itself, rather than relying on domain-specific knowledge. Graphs drawn with these algorithms tend to be aesthetically pleasing, exhibit...
متن کاملForce - Directed Layout for Euler Diagrams Luana
Euler diagrams are the only diagrams that intuitively represent containment, intersection and exclusion of data, but none of the current automatic diagram layout techniques produce good layouts in a reasonable time. We adopt a force-directed approach to automatically layout aesthetically pleasing Euler diagrams in a relatively fast time. A Java prototype demonstrates our novel force model.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998